Section: New Software and Platforms

Dedukti

Keyword: Logical Framework

Functional Description: Dedukti is a proof-checker for the LambdaPi-calculus modulo. As it can be parametrized by an arbitrary set of rewrite rules, defining an equivalence relation, this calculus can express many different theories. Dedukti has been created for this purpose: to allow the interoperability of different theories.

Dedukti's core is based on the standard algorithm for type-checking semi-full pure type systems and implements a state-of-the-art reduction machine inspired from Matita's and modified to deal with rewrite rules.

Dedukti's input language features term declarations and definitions (opaque or not) and rewrite rule definitions. A basic module system allows the user to organize his project in different files and compile them separately.

Dedukti features matching modulo beta for a large class of patterns called Miller's patterns, allowing for more rewriting rules to be implemented in Dedukti.

• Participants: François Thiré, Gaspard Ferey, Guillaume Genestier and Rodolphe Lepigre

• Contact: François Thiré

• Publications: Dedukti:un vérificateur de preuves universel - Rewriting Modulo $\beta$ in the $\lambda$ $\Pi$-Calculus Modulo - Expressing theories in the $\lambda$$\Pi$-calculus modulo theory and in the Dedukti system

• URL: http://dedukti.gforge.inria.fr/